Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Overlapping community discovering algorithm based on latent features
SUN Huixia, LI Yuexin
Journal of Computer Applications    2015, 35 (12): 3477-3480.   DOI: 10.11772/j.issn.1001-9081.2015.12.3477
Abstract602)      PDF (592KB)(328)       Save
In order to solve the problem of exponential increase of label space, an overlapping community discovery algorithm based on latent feature was proposed. Firstly, a generative model for network including overlapping communities was proposed. And based on the proposed generative model, an optimal object function was presented by maximizing the generative probability of the whole network, which was used to infer the latent features for each node in the network. Next, the network was induced into a bipartite graph, and the lower bound of feature number was analyzed, which was used to optimize the object function. The experiments show that, the proposed overlapping community discovering algorithm can improve the recall greatly while keeping the precision and execution efficiency unchanged, which indicates that the proposed algorithm is effective with the exponential increase of label space.
Reference | Related Articles | Metrics